On fractional cut covers

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Directed cycle double covers and cut-obstacles

A directed cycle double cover of a graph G is a family of cycles of G, each provided with an orientation, such that every edge of G is covered by exactly two oppositely directed cycles. Explicit obstructions to the existence of a directed cycle double cover in a graph are bridges. Jaeger [4] conjectured that bridges are actually the only obstructions. One of the difficulties in proving the Jaeg...

متن کامل

Fractional Biclique Covers and Partitions of Graphs

A biclique is a complete bipartite subgraph of a graph. This paper investigates the fractional biclique cover number, bc∗(G), and the fractional biclique partition number, bp∗(G), of a graph G. It is observed that bc∗(G) and bp∗(G) provide lower bounds on the biclique cover and partition numbers respectively, and conditions for equality are given. It is also shown that bc∗(G) is a better lower ...

متن کامل

Circuit and fractional circuit covers of matroids

LetM be a connectedmatroid having a ground set E. Lemos andOxley proved that |E(M)| ≤ 2 c(M)c (M)where c(M) (resp. c(M)) is the circumference (resp. cocircumference) of M. In addition, they conjectured that one can find a collection of at most c(M) circuits which cover the elements ofM at least twice. In this paper, we verify this conjecture for regular matroids. Moreover, we show that a versio...

متن کامل

Nonnegative k-sums, fractional covers, and probability of small deviations

More than twenty years ago, Manickam, Miklós, and Singhi conjectured that for any integers n, k satisfying n ≥ 4k, every set of n real numbers with nonnegative sum has at least ( n−1 k−1 ) kelement subsets whose sum is also nonnegative. In this paper we discuss the connection of this problem with matchings and fractional covers of hypergraphs, and with the question of estimating the probability...

متن کامل

Half-Integral Vertex Covers on Bipartite Bidirected Graphs: Total Dual Integrality and Cut-Rank

In this paper we study systems of the form b ≤ Mx ≤ d, l ≤ x ≤ u, where M is obtained from a totally unimodular matrix with two nonzero elements per row by multiplying by 2 some of its columns, and b, d, l, u are integral vectors. We give an explicit description of a totally dual integral system that describes the integer hull of the polyhedron P defined by the above inequalities. Since the ine...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 2019

ISSN: 0166-218X

DOI: 10.1016/j.dam.2019.03.020